Implementation of Discrete Capability into the Enhanced Multipoint Approximation Method for Solving Mixed Integer-Continuous Optimization Problems
نویسندگان
چکیده
منابع مشابه
Solving Integer and Mixed Integer Linear Problems with ABS Method
Solving mixed integer linear programming (MILP) problems is a difficult task due to the parallel use of both integer and non-integer values. One of the most widely used solution is to solve the problem in the real space and they apply additional iteration steps (so-called cutting-plane algorithms or Gomory’s cuts) to narrow down the solution to the optimal integer solution. The ABS class of alg...
متن کاملMIXED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part 1: the optimization method
This article discusses solving non-linear programming problems containing integer, discrete and continuous variables. The Part 1 of the article describes a novel optimization method based on Differential Evolution algorithm. The required handling techniques for integer, discrete and continuous variables are described including the techniques needed to handle boundary constraints as well as thos...
متن کاملContinuous Discrete Variable Optimization of Structures Using Approximation Methods
Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...
متن کاملUse of Particle Swarm Optimization Algorithm for Solving Integer and Mixed Integer Optimization Problems
This paper presents use of Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart [1] for solving Integer and Mixed Integer Optimization problems. In PSO, The potential solutions, called particles, are flown through the problem space by learning from the current optimal particle and its memory. PSO is started with a group of feasible solutions and a feasibility function ...
متن کاملLogic-Based Outer-Approximation Algorithm for Solving Discrete-Continuous Dynamic Optimization Problems
In this work we present an extension of the Logic Outer-Approximation algorithm for dealing with disjunctive discrete-continuous optimal control problems whose dynamic behavior is modeled in terms of differential-algebraic equations. Although the proposed algorithm can be applied to a wide variety of discrete-continouos optimal control problems we are mainly interested in problems where disjunc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Computational Methods in Engineering Science and Mechanics
سال: 2016
ISSN: 1550-2287,1550-2295
DOI: 10.1080/15502287.2016.1139013